Audit record aggregation in a storage network

ABSTRACT

A method for execution by a dispersed storage and task (DST) processing unit includes obtaining audit records for an audit object and determining when the audit object is complete. When the audit object is complete, aggregating the audit records of the audit object within the audit object by generating the audit object to include the audit records; generating identifier (ID) information and generating integrity information. Fields of the audit object are populated with the audit records, the ID information, and the integrity information and a name of the audit object is determined for storage of the audit object and the name of the audit object in a dispersed storage network (DSN).

CROSS REFERENCE TO RELATED PATENTS

The present U.S. Utility Patent application claims priority pursuant to35 U.S.C. § 120 as a continuation of U.S. Utility application Ser. No.16/860,222, entitled “Audit File Generation In A Dispersed StorageNetwork”, filed Apr. 28, 2020, issued as U.S. Pat. No. 11,243,839 onFeb. 8, 2022 which is a continuation of U.S. Utility application Ser.No. 16/050,920, entitled “AUDIT OBJECT GENERATION IN A DISPERSED STORAGENETWORK”, filed Jul. 31, 2018, issued as U.S. Patent No. 10,656,997 onMay 19, 2020, which is a continuation of U.S. Utility application Ser.No. 15/217,585, entitled “AUDIT OBJECT GENERATION IN A DISPERSED STORAGENETWORK”, filed Jul. 22, 2016, issued as U.S. Pat. No. 10,120,756 onNov. 6, 2018, which is a continuation-in-part of U.S. Utilityapplication Ser. No. 14/954,527, entitled “STORAGE AND RETRIEVAL OFDISPERSED STORAGE NETWORK ACCESS INFORMATION”, filed Nov. 30, 2015,issued as U.S. Pat. No. 9,992,019 on Jun. 5, 2018, which is a divisionalof U.S. patent Ser. No. 13/587,277, entitled “Storage and retrieval ofdispersed storage network access information”, filed Aug. 16, 2012,issued as U.S. Pat. No. 9,229,823 on Jan. 5, 2016, which claims prioritypursuant to 35 U.S.C. § 119(e) to U.S. Provisional Application No.61/524,521, entitled “DISTRIBUTED AUTHENTICATION TOKEN DEVICE”, filedAug. 17, 2011, all of which are hereby incorporated herein by referencein their entirety and made part of the present U.S. Utility PatentApplication for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computer networks and moreparticularly to dispersing error encoded data.

Description of Related Art

Computing devices are known to communicate data, process data, and/orstore data. Such computing devices range from wireless smart phones,laptops, tablets, personal computers (PC), work stations, and video gamedevices, to data centers that support millions of web searches, stocktrades, or on-line purchases every day. In general, a computing deviceincludes a central processing unit (CPU), a memory system, userinput/output interfaces, peripheral device interfaces, and aninterconnecting bus structure.

As is further known, a computer may effectively extend its CPU by using“cloud computing” to perform one or more computing functions (e.g., aservice, an application, an algorithm, an arithmetic logic function,etc.) on behalf of the computer. Further, for large services,applications, and/or functions, cloud computing may be performed bymultiple cloud computing resources in a distributed manner to improvethe response time for completion of the service, application, and/orfunction. For example, Hadoop is an open source software framework thatsupports distributed applications enabling application execution bythousands of computers.

In addition to cloud computing, a computer may use “cloud storage” aspart of its memory system. As is known, cloud storage enables a user,via its computer, to store files, applications, etc. on an Internetstorage system. The Internet storage system may include a RAID(redundant array of independent disks) system and/or a dispersed storagesystem that uses an error correction scheme to encode data for storage.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the present invention;

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data in accordance with the present invention;

FIG. 4 is a schematic block diagram of a generic example of an errorencoding function in accordance with the present invention;

FIG. 5 is a schematic block diagram of a specific example of an errorencoding function in accordance with the present invention;

FIG. 6 is a schematic block diagram of an example of a slice name of anencoded data slice (EDS) in accordance with the present invention;

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of data in accordance with the present invention;

FIG. 8 is a schematic block diagram of a generic example of an errordecoding function in accordance with the present invention;

FIG. 9 is a schematic block diagram of an embodiment of a dispersed ordistributed storage network (DSN) in accordance with the presentinvention; and

FIG. 10A is a diagram illustrating an example of an audit object 230structure.

FIG. 10B is a diagram illustrating an example of an audit record 232structure.

FIG. 10C is a flowchart illustrating an example of generating an auditobject.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of an embodiment of a dispersed, ordistributed, storage network (DSN) 10 that includes a plurality ofcomputing devices 12-16, a managing unit 18, an integrity processingunit 20, and a DSN memory 22. The components of the DSN 10 are coupledto a network 24, which may include one or more wireless and/or wirelined communication systems; one or more non-public intranet systemsand/or public internet systems; and/or one or more local area networks(LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of storage units 36 that may belocated at geographically different sites (e.g., one in Chicago, one inMilwaukee, etc.), at a common site, or a combination thereof. Forexample, if the DSN memory 22 includes eight storage units 36, eachstorage unit is located at a different site. As another example, if theDSN memory 22 includes eight storage units 36, all eight storage unitsare located at the same site. As yet another example, if the DSN memory22 includes eight storage units 36, a first pair of storage units are ata first common site, a second pair of storage units are at a secondcommon site, a third pair of storage units are at a third common site,and a fourth pair of storage units are at a fourth common site. Notethat a DSN memory 22 may include more or less than eight storage units36. Further note that each storage unit 36 includes a computing core (asshown in FIG. 2 , or components thereof) and a plurality of memorydevices for storing dispersed error encoded data.

In various embodiments, each of the storage units operates as adistributed storage and task (DST) execution unit, and is operable tostore dispersed error encoded data and/or to execute, in a distributedmanner, one or more tasks on data. The tasks may be a simple function(e.g., a mathematical function, a logic function, an identify function,a find function, a search engine function, a replace function, etc.), acomplex function (e.g., compression, human and/or computer languagetranslation, text-to-voice conversion, voice-to-text conversion, etc.),multiple simple and/or complex functions, one or more algorithms, one ormore applications, etc. Hereafter, a storage unit may be interchangeablyreferred to as a DST execution unit and a set of storage units may beinterchangeably referred to as a set of DST execution units.

Each of the computing devices 12-16, the managing unit 18, and theintegrity processing unit 20 include a computing core 26, which includesnetwork interfaces 30-33. Computing devices 12-16 may each be a portablecomputing device and/or a fixed computing device. A portable computingdevice may be a social networking device, a gaming device, a cell phone,a smart phone, a digital assistant, a digital music player, a digitalvideo player, a laptop computer, a handheld computer, a tablet, a videogame controller, and/or any other portable device that includes acomputing core. A fixed computing device may be a computer (PC), acomputer server, a cable set-top box, a satellite receiver, a televisionset, a printer, a fax machine, home entertainment equipment, a videogame console, and/or any type of home or office computing equipment.Note that each of the managing unit 18 and the integrity processing unit20 may be separate computing devices, may be a common computing device,and/or may be integrated into one or more of the computing devices 12-16and/or into one or more of the storage units 36.

Each interface 30, 32, and 33 includes software and hardware to supportone or more communication links via the network 24 indirectly and/ordirectly. For example, interface 30 supports a communication link (e.g.,wired, wireless, direct, via a LAN, via the network 24, etc.) betweencomputing devices 14 and 16. As another example, interface 32 supportscommunication links (e.g., a wired connection, a wireless connection, aLAN connection, and/or any other type of connection to/from the network24) between computing devices 12 & 16 and the DSN memory 22. As yetanother example, interface 33 supports a communication link for each ofthe managing unit 18 and the integrity processing unit 20 to the network24.

Computing devices 12 and 16 include a dispersed storage (DS) clientmodule 34, which enables the computing device to dispersed storage errorencode and decode data as subsequently described with reference to oneor more of FIGS. 3-8 . In this example embodiment, computing device 16functions as a dispersed storage processing agent for computing device14. In this role, computing device 16 dispersed storage error encodesand decodes data on behalf of computing device 14. With the use ofdispersed storage error encoding and decoding, the DSN 10 is tolerant ofa significant number of storage unit failures (the number of failures isbased on parameters of the dispersed storage error encoding function)without loss of data and without the need for a redundant or backupcopies of the data. Further, the DSN 10 stores data for an indefiniteperiod of time without data loss and in a secure manner (e.g., thesystem is very resistant to unauthorized attempts at accessing thedata).

In operation, the managing unit 18 performs DS management services. Forexample, the managing unit 18 establishes distributed data storageparameters (e.g., vault creation, distributed storage parameters,security parameters, billing information, user profile information,etc.) for computing devices 12-14 individually or as part of a group ofuser devices. As a specific example, the managing unit 18 coordinatescreation of a vault (e.g., a virtual memory block associated with aportion of an overall namespace of the DSN) within the DSN memory 22 fora user device, a group of devices, or for public access and establishesper vault dispersed storage (DS) error encoding parameters for a vault.The managing unit 18 facilitates storage of DS error encoding parametersfor each vault by updating registry information of the DSN 10, where theregistry information may be stored in the DSN memory 22, a computingdevice 12-16, the managing unit 18, and/or the integrity processing unit20.

The DSN managing unit 18 creates and stores user profile information(e.g., an access control list (ACL)) in local memory and/or withinmemory of the DSN memory 22. The user profile information includesauthentication information, permissions, and/or the security parameters.The security parameters may include encryption/decryption scheme, one ormore encryption keys, key generation scheme, and/or dataencoding/decoding scheme.

The DSN managing unit 18 creates billing information for a particularuser, a user group, a vault access, public vault access, etc. Forinstance, the DSN managing unit 18 tracks the number of times a useraccesses a non-public vault and/or public vaults, which can be used togenerate a per-access billing information. In another instance, the DSNmanaging unit 18 tracks the amount of data stored and/or retrieved by auser device and/or a user group, which can be used to generate aper-data-amount billing information.

As another example, the managing unit 18 performs network operations,network administration, and/or network maintenance. Network operationsincludes authenticating user data allocation requests (e.g., read and/orwrite requests), managing creation of vaults, establishingauthentication credentials for user devices, adding/deleting components(e.g., user devices, storage units, and/or computing devices with a DSclient module 34) to/from the DSN 10, and/or establishing authenticationcredentials for the storage units 36. Network administration includesmonitoring devices and/or units for failures, maintaining vaultinformation, determining device and/or unit activation status,determining device and/or unit loading, and/or determining any othersystem level operation that affects the performance level of the DSN 10.Network maintenance includes facilitating replacing, upgrading,repairing, and/or expanding a device and/or unit of the DSN 10.

The integrity processing unit 20 performs rebuilding of ‘bad’ or missingencoded data slices. At a high level, the integrity processing unit 20performs rebuilding by periodically attempting to retrieve/list encodeddata slices, and/or slice names of the encoded data slices, from the DSNmemory 22. For retrieved encoded slices, they are checked for errors dueto data corruption, outdated version, etc. If a slice includes an error,it is flagged as a ‘bad’ slice. For encoded data slices that were notreceived and/or not listed, they are flagged as missing slices. Badand/or missing slices are subsequently rebuilt using other retrievedencoded data slices that are deemed to be good slices to produce rebuiltslices. The rebuilt slices are stored in the DSN memory 22.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,an 10 interface module 60, at least one IO device interface module 62, aread only memory (ROM) basic input output system (BIOS) 64, and one ormore memory interface modules. The one or more memory interfacemodule(s) includes one or more of a universal serial bus (USB) interfacemodule 66, a host bus adapter (HBA) interface module 68, a networkinterface module 70, a flash interface module 72, a hard drive interfacemodule 74, and a DSN interface module 76.

The DSN interface module 76 functions to mimic a conventional operatingsystem (OS) file system interface (e.g., network file system (NFS),flash file system (FFS), disk file system (DFS), file transfer protocol(FTP), web-based distributed authoring and versioning (WebDAV), etc.)and/or a block memory interface (e.g., small computer system interface(SCSI), internet small computer system interface (iSCSI), etc.). The DSNinterface module 76 and/or the network interface module 70 may functionas one or more of the interface 30-33 of FIG. 1 . Note that the IOdevice interface module 62 and/or the memory interface modules 66-76 maybe collectively or individually referred to as IO ports.

FIG. 3 is a schematic block diagram of an example of dispersed storageerror encoding of data. When a computing device 12 or 16 has data tostore it disperse storage error encodes the data in accordance with adispersed storage error encoding process based on dispersed storageerror encoding parameters. Here, the computing device stores data object40, which can include a file (e.g., text, video, audio, etc.), or otherdata arrangement. The dispersed storage error encoding parametersinclude an encoding function (e.g., information dispersal algorithm,Reed-Solomon, Cauchy Reed-Solomon, systematic encoding, non-systematicencoding, on-line codes, etc.), a data segmenting protocol (e.g., datasegment size, fixed, variable, etc.), and per data segment encodingvalues. The per data segment encoding values include a total, or pillarwidth, number (T) of encoded data slices per encoding of a data segmenti.e., in a set of encoded data slices); a decode threshold number (D) ofencoded data slices of a set of encoded data slices that are needed torecover the data segment; a read threshold number (R) of encoded dataslices to indicate a number of encoded data slices per set to be readfrom storage for decoding of the data segment; and/or a write thresholdnumber (W) to indicate a number of encoded data slices per set that mustbe accurately stored before the encoded data segment is deemed to havebeen properly stored. The dispersed storage error encoding parametersmay further include slicing information (e.g., the number of encodeddata slices that will be created for each data segment) and/or slicesecurity information (e.g., per encoded data slice encryption,compression, integrity checksum, etc.).

In the present example, Cauchy Reed-Solomon has been selected as theencoding function (a generic example is shown in FIG. 4 and a specificexample is shown in FIG. 5 ); the data segmenting protocol is to dividethe data object into fixed sized data segments; and the per data segmentencoding values include: a pillar width of 5, a decode threshold of 3, aread threshold of 4, and a write threshold of 4. In accordance with thedata segmenting protocol, the computing device 12 or 16 divides dataobject 40 into a plurality of fixed sized data segments (e.g., 1 throughY of a fixed size in range of Kilo-bytes to Tera-bytes or more). Thenumber of data segments created is dependent of the size of the data andthe data segmenting protocol.

The computing device 12 or 16 then disperse storage error encodes a datasegment using the selected encoding function (e.g., Cauchy Reed-Solomon)to produce a set of encoded data slices. FIG. 4 illustrates a genericCauchy Reed-Solomon encoding function, which includes an encoding matrix(EM), a data matrix (DM), and a coded matrix (CM). The size of theencoding matrix (EM) is dependent on the pillar width number (T) and thedecode threshold number (D) of selected per data segment encodingvalues. To produce the data matrix (DM), the data segment is dividedinto a plurality of data blocks and the data blocks are arranged into Dnumber of rows with Z data blocks per row. Note that Z is a function ofthe number of data blocks created from the data segment and the decodethreshold number (D). The coded matrix is produced by matrix multiplyingthe data matrix by the encoding matrix.

FIG. 5 illustrates a specific example of Cauchy Reed-Solomon encodingwith a pillar number (T) of five and decode threshold number of three.In this example, a first data segment is divided into twelve data blocks(D1-D12). The coded matrix includes five rows of coded data blocks,where the first row of X11-X14 corresponds to a first encoded data slice(EDS 1_1), the second row of X21-X24 corresponds to a second encodeddata slice (EDS 2_1), the third row of X31-X34 corresponds to a thirdencoded data slice (EDS 3_1), the fourth row of X41-X44 corresponds to afourth encoded data slice (EDS 4_1), and the fifth row of X51-X54corresponds to a fifth encoded data slice (EDS 5_1). Note that thesecond number of the EDS designation corresponds to the data segmentnumber.

Returning to the discussion of FIG. 3 , the computing device alsocreates a slice name (SN) for each encoded data slice (EDS) in the setof encoded data slices. A typical format for a slice name 80 is shown inFIG. 6 . As shown, the slice name (SN) 80 includes a pillar number ofthe encoded data slice (e.g., one of 1−T), a data segment number (e.g.,one of 1−Y), a vault identifier (ID), a data object identifier (ID), andmay further include revision level information of the encoded dataslices. The slice name functions as, at least part of, a DSN address forthe encoded data slice for storage and retrieval from the DSN memory 22.

As a result of encoding, the computing device 12 or 16 produces aplurality of sets of encoded data slices, which are provided with theirrespective slice names to the storage units for storage. As shown, thefirst set of encoded data slices includes EDS 1_1 through EDS 5_1 andthe first set of slice names includes SN 1_1 through SN 5_1 and the lastset of encoded data slices includes EDS 1_Y through EDS 5_Y and the lastset of slice names includes SN 1_Y through SN 5_Y.

FIG. 7 is a schematic block diagram of an example of dispersed storageerror decoding of a data object that was dispersed storage error encodedand stored in the example of FIG. 4 . In this example, the computingdevice 12 or 16 retrieves from the storage units at least the decodethreshold number of encoded data slices per data segment. As a specificexample, the computing device retrieves a read threshold number ofencoded data slices.

To recover a data segment from a decode threshold number of encoded dataslices, the computing device uses a decoding function as shown in FIG. 8. As shown, the decoding function is essentially an inverse of theencoding function of FIG. 4 . The coded matrix includes a decodethreshold number of rows (e.g., three in this example) and the decodingmatrix in an inversion of the encoding matrix that includes thecorresponding rows of the coded matrix. For example, if the coded matrixincludes rows 1, 2, and 4, the encoding matrix is reduced to rows 1, 2,and 4, and then inverted to produce the decoding matrix.

FIG. 9 is a schematic block diagram of another embodiment of a dispersedstorage network (DSN) that includes a managing unit 18 of FIG. 1 , thenetwork 24 of FIG. 1 , and a plurality of storage units 1-n. Themanaging unit 18 can include the interface 33 of FIG. 1 and thecomputing core 26 of FIG. 1 . The managing unit 18 may be referred to asa distributed storage and task (DST) processing unit. Each storage unitmay be implemented utilizing the storage unit 36 of FIG. 1 . The DSNfunctions to store a self-contained audit object in a vault of the DSN.In particular, the DST processing unit operates to obtain audit recordsfor an audit object and determine when the audit object is complete.When the audit object is complete, the DST processing unit operates toaggregate the audit records of the audit object within the audit objectby generating the audit object to include the audit records; generateidentifier (ID) information; generate integrity information; populatefields of the audit object with the audit records, the ID information,and the integrity information; determine a name of the audit object; andfacilitate storage of the audit object and the name of the audit objectin a dispersed storage network (DSN).

In various embodiments, the name of the audit object is determined basedon a virtual DSN address associated with accessing the audit object whenstored as a plurality of audit object slices in the DSN. The name of theaudit object can include a text string name, a sequence number, and/or atimestamp when created or a timestamp associated with when the auditobject may be deleted. Determining when the audit object is complete canbe based on comparing a number of audit records of the audit object toan audit record threshold. Generating the integrity information caninclude at least one of: utilizing an ID associated with the DSTprocessing unit, querying another device of the DSN for the IDinformation or receiving the ID information. Generating the integrityinformation can include at least one of obtaining a certificate,generating a signature of the certificate, or calculating a hash of theaudit object. Facilitating storage of the audit object and the name ofthe audit object can include at least one of: sending the audit objectand the name of the audit object to the DSN for storage or storing theaudit object and the name of the audit object in the DSN.

The further examples of audit object generation can be illustrated inconjunction with the following example. A self-contained audit objectmay contain one or more audit records. Each audit record consists of atime stamp, sequence number, type code, user identification andoptionally a detail message. The timestamp can indicate the date andtime the audit record was created. The sequence number can be amonotonically and consecutively increasing number, the type code is amachine understandable number indicating the type and meaning of theaudit record, the user information indicates the identity of the userwhose action caused the record to be produced and the detail messageprovides additional information related to the record itself. Eachrecord answers the who, what, and when of the data object it correspondsto. In addition to the set of records, the self-contained audit objectcontains identity and integrity information. It answers the question ofwhere the audit object originated from. This information consists of adevice identifier, a certificate chain, and a digital signature. Thisallows the validity of origination for an audit object to be verified bya consumer of the self-contained audit object. It is typical that everyunit making up a DSN aggregates records for some period of time, oruntil some size limit is reached. The unit will then aggregate therecords into a self-contained audit object, apply device identityinformation and a digital signature, and send the object to a reliableand secure storage location. This location may be a vault on the DSN orother storage location. For simplified recovery of the most recent auditobjects, these objects may be given a name which includes a date orsequence number, which allows the reader to request only the mostrecently produced audit objects. While the DST processing unit isdescribed above in conjunction with the operation of managing unit 18,the audit objects may likewise be generated by other DST processingunits, including integrity processing unit 20 and/or computing device 16of FIG. 1 .

FIG. 10A is a diagram illustrating an example of an audit object 230structure. The audit object 230 includes fields for a plurality of auditrecords 1-R 232, a field for identifier (ID) information 234, and afield for integrity information 236. Each audit record field 232 of theaudit records 1-R 232 includes an audit record entry includinginformation related to transactions within a dispersed storage network(DSN). Audit record content is discussed in greater detail withreference to FIG. 10B. The ID information field 234 includes an IDinformation entry including an originator ID associated with the auditobject (e.g., an ID of an entity that created the audit object). Theintegrity information field 236 includes an integrity information entryincluding one or more of a device ID, a certificate chain, and asignature.

FIG. 10B is a diagram illustrating an example of an audit record 232structure. The audit record 232 includes a timestamp field 238, asequence number field 240, a type code field 242, a user identifier (ID)field 244, and a detailed message field 246. The timestamp field 238includes a timestamp entry including a creation timestamp associatedwith a date and/or a time when the audit record 232 was created. Thesequence number field 240 includes a sequence number entry including aunique monotonically increasing number associated with a transactionwithin a dispersed storage network (DSN). The type code field 242includes a type code entry including record type indicator (e.g., a dataaccess audit event or an authentication audit event). The user ID field244 includes a user ID entry including an identifier of one or moreprincipals (e.g., DSN system entities) associated with the audit recordcausing creation of the audit record. The detailed message field 246,when utilized, includes a detailed message entry including moreinformation associated with the audit record 232 including an operationtype (e.g., such as one of write, read, delete, login), a remote address(e.g., an Internet protocol address), a data object identifier, and atarget vault ID.

FIG. 10C is a flowchart illustrating an example of generating an auditobject. In particular, a method is presented for use in conjunction withone or more functions and features described in conjunction with FIGS.1-9 is presented for execution by a dispersed storage and task (DST)processing unit that includes a processor or via another processingsystem of a dispersed storage network that includes at least oneprocessor and memory that stores instruction that configure theprocessor or processors to perform the steps described below. In step248, a processing module (e.g., a dispersed storage (DS) processingunit) obtains a new audit record for an audit object. The obtainingincludes at least one of generating the new audit record and receivingthe new audit record (e.g., from any device of a dispersed storagenetwork (DSN) such as a DS unit). The method continues at step 250 wherethe processing module determines whether the audit object is complete.The determination may be based on comparing a number of audit records ofthe audit object to an audit record threshold. For example, theprocessing module determines that the audit object is complete when thenumber of audit records of the audit object is greater than the auditrecord threshold. The method loops back to step 248 when the processingmodule determines that the audit object is not complete. The methodcontinues to step 252 when the processing module determines that theaudit object is complete.

The method continues at step 252 where the processing module aggregatesaudit records of the audit object within the audit object by generatingthe audit object to include the audit records. The method continues atstep 254 where the processing module generates identifier (ID)information. The generation includes at least one of utilizing an IDassociated with the processing module (e.g., originator), queryinganother device for the ID information, and receiving the ID information.The method continues at step 256 where the processing module generatesintegrity information. The generation includes one or more of obtaininga certificate, generating a signature of the certificate, andcalculating a hash of the audit object.

The method continues at step 258 where the processing module populatesfields of the audit object with the audit records, the ID information,and the integrity information. The method continues at step 260 wherethe processing module determines a name of the audit object. A format ofthe name may be consistent with a virtual DSN address associated withaccessing the audit object when stored as a plurality of audit objectslices in the DSN and may include a text string name, a sequence number,a timestamp when created, and a timestamp associated with when the auditobject may be deleted to enable a DS unit to autonomously delete astored audit object when it is time to delete the audit object. Themethod continues at step 262 where the processing module facilitatesstoring the audit object and the name of the audit object. Thefacilitation includes at least one of storing the audit object and thename of the audit object and sending the audit object and the name ofthe audit object to the DSN for storage therein.

In various embodiments, a non-transitory computer readable storagemedium includes at least one memory section that stores operationalinstructions that, when executed by a processing system of a dispersedstorage network (DSN) that includes a processor and a memory, causes theprocessing system to obtain audit records for an audit object anddetermine when the audit object is complete. When the audit object iscomplete, the processing system operates to aggregate the audit recordsof the audit object within the audit object by generating the auditobject to include the audit records; generate identifier (ID)information; generate integrity information; populate fields of theaudit object with the audit records, the ID information, and theintegrity information; determine a name of the audit object; andfacilitate storage of the audit object and the name of the audit objectin a dispersed storage network (DSN).

In various embodiments, the name of the audit object is determined basedon a virtual DSN address associated with accessing the audit object whenstored as a plurality of audit object slices in the DSN. The name of theaudit object can include a text string name, a sequence number, and/or atimestamp when created or a timestamp associated with when the auditobject may be deleted. Determining when the audit object is complete canbe based on comparing a number of audit records of the audit object toan audit record threshold. Generating the integrity information caninclude at least one of: utilizing an ID associated with the DSTprocessing unit, querying another device of the DSN for the IDinformation or receiving the ID information. Generating the integrityinformation can include at least one of obtaining a certificate,generating a signature of the certificate, or calculating a hash of theaudit object. Facilitating storage of the audit object and the name ofthe audit object can include at least one of: sending the audit objectand the name of the audit object to the DSN for storage or storing theaudit object and the name of the audit object in the DSN.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, audio, etc. any of which may generally be referred to as‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. Such an industry-accepted toleranceranges from less than one percent to fifty percent and corresponds to,but is not limited to, component values, integrated circuit processvariations, temperature variations, rise and fall times, and/or thermalnoise. Such relativity between items ranges from a difference of a fewpercent to magnitude differences. As may also be used herein, theterm(s) “configured to”, “operably coupled to”, “coupled to”, and/or“coupling” includes direct coupling between items and/or indirectcoupling between items via an intervening item (e.g., an item includes,but is not limited to, a component, an element, a circuit, and/or amodule) where, for an example of indirect coupling, the intervening itemdoes not modify the information of a signal but may adjust its currentlevel, voltage level, and/or power level. As may further be used herein,inferred coupling (i.e., where one element is coupled to another elementby inference) includes direct and indirect coupling between two items inthe same manner as “coupled to”. As may even further be used herein, theterm “configured to”, “operable to”, “coupled to”, or “operably coupledto” indicates that an item includes one or more of power connections,input(s), output(s), etc., to perform, when activated, one or more itscorresponding functions and may further include inferred coupling to oneor more other items. As may still further be used herein, the term“associated with”, includes direct and/or indirect coupling of separateitems and/or one item being embedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, and/or “processing unit” may be a singleprocessing device or a plurality of processing devices. Such aprocessing device may be a microprocessor, micro-controller, digitalsignal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, and/or processing unit may be, or furtherinclude, memory and/or an integrated memory element, which may be asingle memory device, a plurality of memory devices, and/or embeddedcircuitry of another processing module, module, processing circuit,and/or processing unit. Such a memory device may be a read-only memory,random access memory, volatile memory, non-volatile memory, staticmemory, dynamic memory, flash memory, cache memory, and/or any devicethat stores digital information. Note that if the processing module,module, processing circuit, and/or processing unit includes more thanone processing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,and/or processing unit implements one or more of its functions via astate machine, analog circuitry, digital circuitry, and/or logiccircuitry, the memory and/or memory element storing the correspondingoperational instructions may be embedded within, or external to, thecircuitry comprising the state machine, analog circuitry, digitalcircuitry, and/or logic circuitry. Still further note that, the memoryelement may store, and the processing module, module, processingcircuit, and/or processing unit executes, hard coded and/or operationalinstructions corresponding to at least some of the steps and/orfunctions illustrated in one or more of the Figures. Such a memorydevice or memory element can be included in an article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with other routines. In this context, “start” indicates thebeginning of the first step presented and may be preceded by otheractivities not specifically shown. Further, the “continue” indicationreflects that the steps presented may be performed multiple times and/ormay be succeeded by other activities not specifically shown. Further,while a flow diagram indicates a particular ordering of steps, otherorderings are likewise possible provided that the principles ofcausality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form a solidstate memory, a hard drive memory, cloud memory, thumb drive, servermemory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for execution by a storage processingunit that includes a processor, the method comprises: obtaining auditrecords, wherein each of the audit records indicates: a timestamp for acorresponding message, at least one event type code selected from aplurality of event type codes for a corresponding audit event of thecorresponding message, and an identifier for a corresponding systementity associated with creation of the corresponding message, andwherein at least one of the audit records includes an object identifierand an operation type indicating one of: a write operation, a readoperation, or a delete operation; aggregating a number of audit recordsover a period of time; generating an audit file to include the number ofaudit records and integrity information; and facilitating storage of theaudit file by utilizing a name of the audit file that indicates a date.2. The method of claim 1, wherein the name of the audit file isdetermined based on a virtual storage network address associated withaccessing the audit file when stored as a plurality of audit file slicesin a storage network.
 3. The method of claim 1, wherein the name of theaudit file further includes at least one of: a text string name or asequence number.
 4. The method of claim 1, wherein the name of the auditfile further includes at least one of: a timestamp when created or atimestamp associated with when the audit file may be deleted.
 5. Themethod of claim 1, wherein the integrity information is generated basedon at least one of: utilizing an ID associated with the storageprocessing unit, querying another device of a storage network for IDinformation, or receiving the ID information.
 6. The method of claim 1,wherein the integrity information is generated based on at least one ofobtaining a certificate, generating a signature of the certificate, orcalculating a hash of the audit file.
 7. The method of claim 1, whereinfacilitating storage of the audit file by utilizing the name of theaudit file includes at least one of: sending the audit file and the nameof the audit file to a storage network for storage, or storing the auditfile and the name of the audit file in the storage network.
 8. Aprocessing system of a storage network comprises: at least oneprocessor; a memory that stores operational instructions that, whenexecuted by the at least one processor, cause the processing system toperform operations that include: obtaining audit records, wherein eachof the audit records indicates: a timestamp for a corresponding message,at least one event type code selected from a plurality of event typecodes for a corresponding audit event of the corresponding message, andan identifier for a corresponding system entity associated with creationof the corresponding message, and wherein at least one of the auditrecords includes an object identifier and an operation type indicatingone of: a write operation, a read operation, or a delete operation;aggregating a number of audit records over a period of time; generatingan audit file to include the number of audit records and integrityinformation; and facilitating storage of the audit file by utilizing aname of the audit file that indicates a date.
 9. The processing systemof claim 8, wherein the name of the audit file is determined based on avirtual storage network address associated with accessing the audit filewhen stored as a plurality of audit file slices in the storage network.10. The processing system of claim 8, wherein the name of the audit fileincludes at least one of: a text string name or a sequence number. 11.The processing system of claim 8, wherein the name of the audit fileincludes at least one of: a timestamp when created or a timestampassociated with when the audit file may be deleted.
 12. The processingsystem of claim 8, wherein the integrity information is generated basedon at least one of: utilizing an ID associated with the processingsystem, querying another device of the storage network for IDinformation, or receiving the ID information.
 13. The processing systemof claim 8, wherein the integrity information is generated based on atleast one of obtaining a certificate, generating a signature of thecertificate, or calculating a hash of the audit file.
 14. The processingsystem of claim 8, wherein facilitating storage of the audit fileutilizing the name of the audit file includes at least one of: sendingthe audit file and the name of the audit file to the storage network forstorage or storing the audit file and the name of the audit file in thestorage network.
 15. A non-transitory computer readable storage mediumcomprises: at least one memory section that stores operationalinstructions that, when executed by a processing system of a storagenetwork that includes a processor and a memory, causes the processingsystem to perform operations that include: obtaining audit records,wherein each of the audit records indicates: a timestamp for acorresponding message, at least one event type code selected from aplurality of event type codes for a corresponding audit event of thecorresponding message, and an identifier for a corresponding systementity associated with creation of the corresponding message, andwherein at least one of the audit records includes an object identifierand an operation type indicating one of: a write operation, a readoperation, or a delete operation; aggregating a number of audit recordsover a period of time; generating an audit file to include the number ofaudit records and integrity information; and facilitating storage of theaudit file by utilizing a name of the audit file that indicates a date.16. The non-transitory computer readable storage medium of claim 15,wherein the name of the audit file is determined based on a virtualstorage network address associated with accessing the audit file whenstored as a plurality of audit file slices in the storage network. 17.The non-transitory computer readable storage medium of claim 15, whereinthe name of the audit file includes at least one of: a text string nameor a sequence number.
 18. The non-transitory computer readable storagemedium of claim 15, wherein the name of the audit file includes at leastone of: a timestamp when created or a timestamp associated with when theaudit file may be deleted.
 19. The non-transitory computer readablestorage medium of claim 15, wherein the integrity information isgenerated based on at least one of: utilizing an ID associated with theprocessing system, querying another device of the storage network for IDinformation, or receiving the ID information.
 20. The non-transitorycomputer readable storage medium of claim 15, wherein the integrityinformation is generated based on at least one of obtaining acertificate, generating a signature of the certificate, or calculating ahash of the audit file.